A Note on the Linear Programming Sensitivity Analysis of Specification Constraints in Blending Problems

نویسنده

  • Umit Akinc
چکیده

In blending problems there are typically specification constraints that limit the content of various properties of the blend that it acquires from the ingredients to certain maximum or minimum percentages of the total blend. For sake of linearity, these constraints are commonly included in the problem in a way that precludes direct sensitivity analysis with respect to changes in these percentages. This note shows that the sensitivity analysis with respect to changes in the target specification percentages can be derived from the ordinary sensitivity analysis with minimum additional effort; and that common LP codes can be slightly modified to facilitate sensitivity analysis of blending percentages.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS

There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...

متن کامل

ORE extraction and blending optimization model in poly- metallic open PIT mines by chance constrained one-sided goal programming

Determination a sequence of extracting ore is one of the most important problems in mine annual production scheduling. Production scheduling affects mining performance especially in a poly-metallic open pit mine with considering the imposed operational and physical constraints mandated by high levels of reliability in relation to the obtained actual results. One of the important operational con...

متن کامل

SENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS

In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary. 

متن کامل

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

متن کامل

A multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming

Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007